Automated Image Mosaicing based on Levenberg-Marquardt method.

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Levenberg-Marquardt Method based on Sobolev gradients

We extend the theory of Sobolev gradients to include variable metric methods, such as Newton’s method and the Levenberg-Marquardt method, as gradient descent iterations associated with stepwise variable inner products. In particular, we obtain existence, uniqueness, and asymptotic convergence results for a gradient flow based on a variable inner product.

متن کامل

On a Global Complexity Bound of the Levenberg-Marquardt Method

In this paper, we propose a new updating rule of the LevenbergMarquardt (LM) parameter for the LM method for nonlinear equations. We show that the global complexity bound of the new LM algorithm is O( −2), that is, it requires at most O( −2) iterations to derive the norm of the gradient of the merit function below the desired accuracy . Host: Jiawang Nie Wednesday, November 1, 2017 4:00 PM AP&M...

متن کامل

Levenberg Marquardt ( LM ) Algorithm 1 –

1 – Introduction Parameter estimation for function optimization is a well established problem in computing, as there are countless applications in practice. For this work, we will focus specifically in implementing a distributed and parallel implementation of the Levenberg Marquardt algorithm, which is a well established numerical solver for function approximation given a limited data set. Para...

متن کامل

Modified Levenberg-Marquardt Method for Neural Networks Training

In this paper a modification on Levenberg-Marquardt algorithm for MLP neural network learning is proposed. The proposed algorithm has good convergence. This method reduces the amount of oscillation in learning procedure. An example is given to show usefulness of this method. Finally a simulation verifies the results of proposed method. Keywords—Levenberg-Marquardt, modification, neural network,...

متن کامل

Hybrid Levenberg–Marquardt and weak-constraint ensemble Kalman smoother method

The ensemble Kalman smoother (EnKS) is used as a linear least-squares solver in the Gauss–Newton method for the large nonlinear least-squares system in incremental 4DVAR. The ensemble approach is naturally parallel over the ensemble members and no tangent or adjoint operators are needed. Furthermore, adding a regularization term results in replacing the Gauss–Newton method, which may diverge, b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Japan society of photogrammetry and remote sensing

سال: 1998

ISSN: 0285-5844,1883-9061

DOI: 10.4287/jsprs.37.3_42